CLOS Efficiency: Instantiation

نویسنده

  • Didier Verna
چکیده

This article reports the results of an ongoing experimental research on the behavior and performance of CLOS, the COMMON-LISP Object System. Our purpose is to evaluate the behavior and performance of the 3 most important characteristics of any dynamic object-oriented system: class instantiation, slot access and dynamic dispatch. This paper describes the results of our experiments on instantiation. We evaluate the efficiency of the instantiation process in both C++ and LISP under a combination of parameters such as slot types or classes hierarchy. We show that in a non-optimized configuration where safety is given priority on speed, the behavior of C++ and LISP instantiation can be quite different, which is also the case amongst different LISP compilers. On the other hand, we demonstrate that when compilation is tuned for speed, instantiation in LISP becomes faster than in C++.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Routing of asynchronous Clos networks

Clos networks provide the theoretically optimal solution to build high-radix switches. Dynamically reconfiguring a three-stage Clos network is more difficult in asynchronous circuits than in synchronous circuits. This paper proposes a novel asynchronous dispatching (AD) algorithm for general three-stage Clos networks. It is compared with the classic synchronous concurrent round-robin dispatchin...

متن کامل

Simulation of a Mesh of Clos Wormhole Network

Wiring constraints often result in a trade-off between efficiency and realizability when designing communication networks for multicomputers. By combining the connectivity of multistage networks with the easy to realize mesh networks, the Mesh of Clos topology tries to narrow this gap. In this paper, a simulation study is presented in order to evaluate wormhole routed Mesh of Clos communication...

متن کامل

Evaluation of a Mesh of Clos wormhole network

The pursuit of high connectivity in network design for multicomputers is often complicated by wiring constraints, resulting in a trade-off between efficiency and realizability. The Mesh of Clos topology addresses this trade-off by combining a multistage network with a mesh network. In this paper, a simulation study is presented in order to evaluate wormhole-routed Mesh of Clos communication net...

متن کامل

Graph Optimization Approaches for Minimal Rerouting in Symmetric Three Stage Clos Networks

We consider routing in symmetrical three stage Clos networks. Especially we search for the routing of an additional connection that requires the least rearrangements, i.e. the minimal number of changes of already routed connections. We describe polynomial methods, based on matchings and edge colorings. The basic idea is to swap colors along alternating paths. The paths need to be maximal, and t...

متن کامل

Securing Abe's Mix-net Against Malicious Verifiers via Witness Indistinguishability

We show that the simple and appealing unconditionally sound mix-net due to Abe (Asiacrypt’99) can be augmented to further guarantee anonymity against malicious verifiers. This additional guarantee implies, in particular, that when applying the Fiat-Shamir transform to the mix-net’s underlying sub-protocols, anonymity is provably guaranteed for any hash function. As our main contribution, we dem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009